منابع مشابه
Directed Hypergraph Planarity
Directed hypergraphs are generalizations of digraphs and can be used to model binary relations among subsets of a given set. Planarity of hypergraphs was studied by Johnson and Pollak; in this paper we extend the planarity concept to directed hypergraphs. It is known that the planarity of a digraph relies on the planarity of its underlying graph. However, for directed hypergraphs, this property...
متن کاملResults on hypergraph planarity
Using the notion of planarity and drawing for hypergraphs introduced respectively by Johnson and Pollak [9] and Mäkinen [14], we show in this paper that any hypergraph having less than nine hyperedges is vertex-planar and can be drawn in the edge standard and in the subset standard without edge crossing.
متن کاملHypergraph Drawing by Force-Directed Placement
We address the problem of drawing hypergraphs. We propose and evaluate a family of algorithms that transform a hypergraph drawing problem into a graph drawing problem. Each algorithm in the family relies on a different encoding of a hyperedge into a set of edges. The algorithms can then use any graph drawing algorithms. However, we here focus on the force-directed algorithms. We propose and dis...
متن کاملA Directed Hypergraph Model for RDF
1 Related Work An RDF document can be viewed as a graph: nodes are resources and arcs are properties. Formally [4], suppose there are three infinite sets: U (URIs), B = {bj : j ∈ N} (blank nodes), and L (literals). (s, p, o) ∈ (U∪B)×U×(U∪B∪L) is an RDF triple, s is called the subject, p the predicate, and o the object. An RDF graph T is a set of RDF triples. The universe of T , univ(T ), is the...
متن کاملSwitch-Regular Upward Planarity Testing of Directed Trees
Upward planar drawings of digraphs are crossing free drawings where all edges flow in the upward direction. The problem of deciding whether a digraph admits an upward planar drawing is called the upward planarity testing problem, and it has been widely studied in the literature. In this paper we investigate a new upward planarity testing problem, that is, deciding whether a digraph admits an up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2005
ISSN: 0101-7438
DOI: 10.1590/s0101-74382005000300005